cyclomatic number造句

• The cyclomatic number of the graph is defined as the dimension of this space.
• Under the name of cyclomatic number, the concept was introduced by Gustav Kirchhoff.
• The corank of the graphic matroid is known as the circuit rank or cyclomatic number.
• Since GF ( 2 ) has two elements and the cycle space is necessarily finite, the cyclomatic number is also equal to the 2-logarithm of the number of elements in the cycle space.
• It may also be solved in polynomial time for graphs of bounded cyclomatic number, but this algorithm is again not fixed-parameter tractable ( for the parameter " cyclomatic number " ) because the exponent in the polynomial depends on the cyclomatic number.
• It may also be solved in polynomial time for graphs of bounded cyclomatic number, but this algorithm is again not fixed-parameter tractable ( for the parameter " cyclomatic number " ) because the exponent in the polynomial depends on the cyclomatic number.
• It may also be solved in polynomial time for graphs of bounded cyclomatic number, but this algorithm is again not fixed-parameter tractable ( for the parameter " cyclomatic number " ) because the exponent in the polynomial depends on the cyclomatic number.
• Graphs with bounded cyclomatic number, vertex cover number or max leaf number all have bounded treewidth, however it is an open problem to determine the complexity of the metric dimension problem even on graphs of treewidth 2, that is, series-parallel graphs.
• Other numbers defined in a similar way by edge deletion in an undirected graph include the edge connectivity, the minimum number of edges to delete in order to disconnect the graph, and the cyclomatic number, the minimum number of edges to delete in order to eliminate all cycles.